//1541-1613
#include <bits/stdc++.h>
using namespace std;
int n;
int blo;
int a[100005];
int out[100005];
int used[100005];
int s[100005];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    sort(a+1,a+1+n);
    for(int i=1;i<=n;i++){
        if(a[i]!=a[i-1]){
            blo++;
        }
        s[blo]++;
    }
    for(int i=1;i<=blo;i++){
        used[i]=s[i];
    }
    for(int i=2;i<=blo;i++){
        if(used[i]>=s[i-1]){
            used[i]-=s[i-1];
            s[i-1]=0;
        }
        else if(used[i]<s[i-1]){
            s[i-1]-=used[i];
            used[i]=0;
            s[i]+=s[i-1];
        }
    }
    cout<<s[blo];
    return 0;
}
